Search results for "Minimum distance"
showing 9 items of 9 documents
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
MMD codes in a more general sense
2002
Summary form only given. The author deals with the characterisation of maximum minimum distance (MMD) codes in a more general sense, which has been completed in a joint work with Olsson. As in the m=1 case the weight distribution of an MMD code /spl Cscr/ is uniquely determined by its parameters [n,k,d]/sub q/.
Best Proximity Point Results in Non-Archimedean Fuzzy Metric Spaces
2013
We consider the problem of finding a best proximity point which achieves the minimum distance between two nonempty sets in a non-Archimedean fuzzy metric space. First we prove the existence and uniqueness of the best proximity point by using di fferent contractive conditions, then we present some examples to support our best proximity point theorems.
The “λ-medial axis”
2005
Medial axis is known to be unstable for nonsmooth objects. For an open set O, we define the weak feature size, wfs, minimum distance between Oc and the critical points of the function distance to Oc. We introduce the "lambda-medial axis" Mλ of O, a subset of the medial axis of O which captures the homotopy type of O when λ < wfs. We show that, at least for some "regular" values of λ, Mλ remains stable under Hausdorff distance perturbations of Oc.
The squared symmetric FastICA estimator
2017
In this paper we study the theoretical properties of the deflation-based FastICA method, the original symmetric FastICA method, and a modified symmetric FastICA method, here called the squared symmetric FastICA. This modification is obtained by replacing the absolute values in the FastICA objective function by their squares. In the deflation-based case this replacement has no effect on the estimate since the maximization problem stays the same. However, in the symmetric case we obtain a different estimate which has been mentioned in the literature, but its theoretical properties have not been studied at all. In the paper we review the classic deflation-based and symmetric FastICA approaches…
A method for quantifying atrial fibrillation organization based on wave-morphology similarity
2002
A new method for quantifying the organization of single bipolar electrograms recorded in the human atria during atrial fibrillation (AF) is presented. The algorithm relies on the comparison between pairs of local activation waves (LAWs) to estimate their morphological similarity, and returns a regularity index (/spl rho/) which measures the extent of repetitiveness over time of the detected activations. The database consisted of endocardial data from a multipolar basket catheter during AF and intraatrial recordings during atrial flutter. The index showed maximum regularity (/spl rho/=1) for all atrial flutter episodes and decreased significantly when increasing AF complexity as defined by W…
A more efficient second order blind identification method for separation of uncorrelated stationary time series
2016
The classical second order source separation methods use approximate joint diagonalization of autocovariance matrices with several lags to estimate the unmixing matrix. Based on recent asymptotic results, we propose a novel unmixing matrix estimator which selects the best lag set from a finite set of candidate sets specified by the user. The theory is illustrated by a simulation study.
A more efficient second order blind identification method for separation of uncorrelated stationary time series
2016
The classical second order source separation methods use approximate joint diagonalization of autocovariance matrices with several lags to estimate the unmixing matrix. Based on recent asymptotic results, we propose a novel unmixing matrix estimator which selects the best lag set from a finite set of candidate sets specified by the user. The theory is illustrated by a simulation study. peerReviewed
Effects of Rule Changes on Game-Related Statistics in Men's Water Polo Matches
2017
The aim of this study was to investigate the effects of rule changes on game-related statistics in men's water polo matches. A total of 856 men's matches played in all Olympic Games and World Championship since 1936 was analysed. The game-related statistics considered were: total goals, winners' goals, losers' goals, goals per minute, goals difference, relationship difference goals and total goals, and relationship difference goals and winners' goals. The rule changes were grouped by structural (game and period) and functional changes (possession time, exclusion time, timing, minimum distance to take a direct shot). Differences between rule changes were determined using a one-way ANOVA. In …